Search results
93 packages found
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Measure the difference between two strings using the Levenshtein distance algorithm
- leven
- levenshtein
- distance
- algorithm
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
- closest
- compare
- comparison
- didyoumean
- diff
- difference
- distance
- edit
- find
- fuzzy
- leven
- levenshtein
- match
- matching
- View more
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
Sort array of strings by Levenshtein (Sift4) distance
Fastest Levenshtein distance implementation in JS.
Get the distance of a substring from the start of a line
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
Find lexicographical points between strings
Fast string matcher conceived for quick replies chat and multiple choice scenario.
All mismatch between two strings
Fast String Distance (SIFT) Algorithm
Calculates de pair distance between two strings
An implementation of weighted Damerau–Levenshtein distance.
A JS module for calculating several distances between two (n-dimensional) points
NPM package that calculates synchronously or asynchronously the Damerau-Levenshtein distance between strings
Search for a malformed string. Think of Levenshtein distance but in search.